Equitable Dominating in an Intunionistic Fuzzy Graphs
نویسندگان
چکیده
Let G be an intuitionistic fuzzy graph. Let u and v be two vertices of G. A subset D of V is called a fuzzy equitable dominating set if every v ∈ V − Dthere exist a vertex u ∈ D such that uv ∈ E(G) and |deg(u) − deg(v)| = 1 where deg(u) denotes the degree of vertex u and deg(v) denotes the degree of vertex v and μ2(vi, vj ) = μ1(vi) ∧ μ1(vj ), γ2(vi, vj ) = γ1(vi) ∨ γ1(vj ). The minimum cardinality of an intuitionistic fuzzy equitable dominating set is denoted by γeif . In this paper we introduce the concept of intuitionistic fuzzy equitable dominating set, minimal intuitionistic fuzzy equitable dominating set, and intuitionistic fuzzy equitable independent set further obtain some interesting results for this new parameter in equitable intuitionistic fuzzy graphs. 2336 J. John Stephan, A. Muthaiyan, and N. Vinoth Kumar AMS subject classification:
منابع مشابه
Strength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملVertex Minimal and Common Minimal Equitable Dominating Graphs
In this paper we introduce the common minimal equitable and vertex minimal equitable dominating graph and we get characterize the common minimal equitable and vertex minimal equitable dominating graph which are either connected or complete, some new results of these graphs are obtained. Mathematics Subject Classification: 05C70
متن کاملEqui independent equitable domination number of cycle and bistar related graphs
A subset D of ( ) V G is called an equitable dominating set if for every ( ) v V G D there exists a vertex u D such that ( ) uv E G and | ( ) ( ) | 1 deg u deg v . A subset D of ( ) V G is called an equitable independent set if for any , u D v ( ) e N u for all { } v D u . The concept of equi independent equitable domination is a combination of these two important concepts. ...
متن کاملEquitable Edge Domination in Graphs
A subset D of V (G) is called an equitable dominating set of a graph G if for every v ∈ (V − D), there exists a vertex u ∈ D such that uv ∈ E(G) and |deg(u) − deg(v)| 6 1. The minimum cardinality of such a dominating set is denoted by γe(G) and is called equitable domination number of G. In this paper we introduce the equitable edge domination and equitable edge domatic number in a graph, exact...
متن کاملNeighborhood Connected Equitable Domination in Graphs
Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhood connected equitable dominating set (nced-set) if the induced subgraph 〈Ne(S)〉 is connected The minimum cardinality of a nced-set of G is called the neighborhood connected equitable domination number of G and is denoted by γnce(G). In this paper we initiate a study of this parameter. For any gra...
متن کامل